Proving Determinacy of the PharOS Real-Time Operating System
نویسندگان
چکیده
Executions in the PharOS real-time system are deterministic in the sense that the sequence of local states for every process is independent of the order in which processes are scheduled. The essential ingredient for achieving this property is that a temporal window of execution is associated with every instruction. Messages become visible to receiving processes only after the time window of the sending message has elapsed. We present a high-level model of PharOS in TLA and formally state and prove determinacy using the TLA Proof System.
منابع مشابه
Implementation of Random Forest Algorithm in Order to Use Big Data to Improve Real-Time Traffic Monitoring and Safety
Nowadays the active traffic management is enabled for better performance due to the nature of the real-time large data in transportation system. With the advancement of large data, monitoring and improving the traffic safety transformed into necessity in the form of actively and appropriately. Per-formance efficiency and traffic safety are considered as an im-portant element in measuring the pe...
متن کاملPharos: An Application-Oriented Testbed for Heterogeneous Wireless Networking Environments
This paper presents the Pharos mobile computing testbed which focuses on application-driven validation of pervasive computing research using real hardware and real mobility. Pharos enables meaningful and reproducible validation at all levels of the network stack, including mobility modeling, routing protocols, coordination, application support, and system configuration. At the same time, the te...
متن کاملChopper-Based Real-Time Load Emulator with Feed-Forward and Hysteresis Current Controller
Nowadays, the usage of load emulators, is the best method for implementation and analysis of different electrical load change scenarios in laboratories. This paper presents an improved programmable load emulator which can emulate both reference active and reactive power simultaneously. The proposed control system can track the dynamic load changes rapidly and accurately in addition to pulse cha...
متن کاملMachine-Checkable Timed CSP
The correctness of safety-critical embedded software is crucial, whereas non-functional properties like deadlock-freedom and real-time constraints are particularly important. The real-time calculus Timed CSP is capable of expressing such properties and can therefore be used to verify embedded software. In this paper, we present our formalization of Timed CSP in the Isabelle/HOL theorem prover, ...
متن کاملOS Verification - Now!
Hard, machine-supported formal verification of software is at a turning point. Recent years have seen theorem proving tools maturing with a number of successful, real-life applications. At the same time, small highperformance OS kernels, which can drastically reduce the size of the trusted computing base, have become more popular. We argue that the combination of those two trends makes it feasi...
متن کامل